Rational approximation preconditioners for sparse linear systems
نویسندگان
چکیده
منابع مشابه
Rational Approximation Preconditioners for General Sparse Linear Systems
This paper presents a class of preconditioning techniques which exploit rational function approximations to the original matrix. The matrix is rst shifted and then an incomplete LU factorization of the resulting matrix is computed. The resulting factors are then used to compute a better preconditioner to the original matrix. Since the incomplete factorization is made on a shifted matrix, a good...
متن کاملWavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equations (PDEs) in a wide variety of scientific and engineering disciplines are introduced. Complete and Incomplete Discrete Wavelet Transforms in conjunction with row and column permutations are used in the construction of ...
متن کاملBlock Approximate Inverse Preconditioners for Sparse Nonsymmetric Linear Systems
Abstract. In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves consecutive updates of variable rank of an initial and nonsingular matrix A0 and the application of the Sherman-MorrisonWoodbury formula to compute an approximate inverse decomposition of...
متن کاملMultipole-based preconditioners for large sparse linear systems
Dense operators for preconditioning sparse linear systems have traditionally been considered infeasible due to their excessive computational and memory requirements. With the emergence of techniques such as block low-rank approximations and hierarchical multipole approximations, the cost of computing and storing these preconditioners has reduced dramatically. This paper describes the use of mul...
متن کاملSparse symmetric preconditioners for dense linear systems in electromagnetism
We consider symmetric preconditioning strategies for the iterative solution of dense complex symmetric non-Hermitian systems arising in computational electromagnetics. In particular we report on the numerical behaviour of the classical Incomplete Cholesky factorization as well as some of its recent variants and consider also well known factorized approximate inverses. We illustrate the difficul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2003
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(03)00480-1